Anarchy in the UJ: Coordination mechanisms for minimizing the number of late jobs

نویسندگان

چکیده

We consider the distributed scheduling problem on parallel machines with central objective of maximizing number on-time jobs. Jobs are self-interested utility-maximizers that can choose they processed and exclusively interested in reducing their own private function. Each machine processes jobs according to a local policy. discuss Nash equilibria resulting schedules perform thorough analysis (absolute) prices anarchy for various environments, utilities agents, policies machines. show based simple sorting-based procedures like shortest processing time first (SPT) earliest due date (EDD) lead big losses welfare compared global optimum. However, when employing Moore-Hodgson’s algorithm as policy, we prove price (2m−1)/m identical 2 related unrelated Moreover, how these results be used approximation ratios greedy algorithms. This paper is two procedures, turning them from heuristics into actual provable ratio.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour

this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...

the test for adverse selection in life insurance market: the case of mellat insurance company

انتخاب نامساعد یکی از مشکلات اساسی در صنعت بیمه است. که ابتدا در سال 1960، توسط روتشیلد واستیگلیتز مورد بحث ومطالعه قرار گرفت ازآن موقع تاکنون بسیاری از پژوهشگران مدل های مختلفی را برای تجزیه و تحلیل تقاضا برای صنعت بیمه عمر که تماما ناشی از عدم قطعیت در این صنعت میباشد انجام داده اند .وهدف از آن پیدا کردن شرایطی است که تحت آن شرایط انتخاب یا کنار گذاشتن یک بیمه گزار به نفع و یا زیان شرکت بیمه ...

15 صفحه اول

Models for Minimizing the Weighted Number of Late Jobs with Deterministic Machine Availability Constraints

We study the problem of minimizing the weighted number of tardy jobs on a single machine with deterministic machine availability constraints. We show that the cases with resumable and non-resumable jobs (1, hk|ri, nr − a| ∑ wiUi and 1, hk|ri, r − a| ∑ wiUi) can both be modeled as a more general scheduling problem, consisting in selecting and scheduling jobs on parallel machines subject to time ...

متن کامل

Lagrangean Relaxation for Minimizing the Weighted Number of Late Jobs on Parallel Machines

This paper presents a Lagrangean relaxation approach for solving a parallel machine scheduling problem where the objective function is to minimize the weighted number of late jobs. The approach is an extension of an approach that has been successfully applied to the one-machine case. It is the first method that gives lower bounds to the problem when an exact solution cannot be found.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2022

ISSN: ['1872-6860', '0377-2217']

DOI: https://doi.org/10.1016/j.ejor.2021.11.047